Non-hereditary Minimum Deep Coalescence trees

نویسندگان

  • Mareike Fischer
  • Martin Kreidl
چکیده

— One of the goals of phylogenetic research is to find the species tree describing the evolutionary history of a set of species. But the trees derived from geneti data with the help of tree inference methods are gene trees that need not coincide with the species tree. This can for example happen when so-called deep coalescence events take place. It is also known that species trees can differ from their most likely gene trees. Therefore, as a means to find the species tree, it has been suggested to use subtrees of the gene trees, for example triples, and to puzzle them together in order to find the species tree. In this paper, we will show that this approach may lead to wrong trees regarding the minimum deep coalescence criterion (MDC). In particular, we present an example in which the optimal MDC tree is unique, but none of its triple subtrees fulfills the MDC criterion. In this sense, MDC is a non-hereditary tree reconstruction method. (

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mean deep coalescence cost under exchangeable probability distributions

We derive formulas for mean deep coalescence cost, for either a fixed species tree or a fixed gene tree, under probability distributions that satisfy the exchangeability property. We then apply the formulas to study mean deep coalescence cost under two commonly used exchangeable models—the uniform and Yule models. We find that mean deep coalescence cost, for either a fixed species tree or a fix...

متن کامل

Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms

Gene tree reconciliation problems invoke the minimum number of evolutionary events that reconcile gene evolution within the context of a species tree. Here we focus on the deep coalescence (DC) problem, that is, given an unrooted gene tree and a rooted species tree, find a rooting of the gene tree that minimizes the number of DC events, or DC cost, when reconciling the gene tree with the specie...

متن کامل

From gene trees to species trees II: Species tree inference in the deep coalescence model

When gene copies are sampled from various species, the resulting gene tree might disagree with the containing species tree. The primary causes of gene tree and species tree discord include lineage sorting, horizontal gene transfer, and gene duplication and loss. Each of these events yields a different parsimony criterion for inferring the (containing) species tree from gene trees. With lineage ...

متن کامل

Consistency Properties of Species Tree Inference by Minimizing Deep Coalescences

Methods for inferring species trees from sets of gene trees need to account for the possibility of discordance among the gene trees. Assuming that discordance is caused by incomplete lineage sorting, species tree estimates can be obtained by finding those species trees that minimize the number of "deep" coalescence events required for a given collection of gene trees. Efficient algorithms now e...

متن کامل

Comparison of species tree methods for reconstructing the phylogeny of bearded manakins (Aves: Pipridae, Manacus) from multilocus sequence data.

Although the power of multi-locus data in estimating species trees is apparent, it is also clear that the analytical methodologies for doing so are still maturing. For example, of the methods currently available for estimating species trees from multilocus data, the Bayesian method introduced by Liu and Pearl (2007; BEST) is the only one that provides nodal support values. Using gene sequences ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015